Local identification of scalar hybrid models with tree structure
نویسندگان
چکیده
منابع مشابه
Local identification of scalar hybrid models with tree structure
Standard modeling approaches, for example in chemical engineering, suffer from two principal difficulties: the curse of dimension and a lack of extrapolability. We propose an approach via structured hybrid models to resolve both issues. For simplicity we consider reactor models which can be written as a tree-like composition of scalar input-output functions uj. The vertices j of the finite tree...
متن کاملStructure Identification of Multiple Models with Output Error Local Models
The paper aims to optimise the structure of a multiple model described by output error local models. Two complementary techniques are proposed for this purpose. The first one deals with the simplification of the local model structure using a pruning approach. The second concerns the optimisation of the number of sub-models and consists in merging neighbouring models that can describe the same b...
متن کاملساختار کلاسهایی از حلقه های z- موضعی و c- موضعی the structure of some classes of z-local and c-local rings
فرض کنیمr یک حلقه تعویض پذیر ویکدار موضعی باشدو(j(r رایکال جیکوبسن r و(z(r مجموعه مقسوم علیه های صفر حلقه r باشد.گوییم r یک حلقه z- موضعی است هرگاه j(r)^2=. .همچنین برای یک حلقه تعویض پذیر r فرض کنیم c یک عنصر ناصفر از (z( r باشد با این خاصیت که cz( r)=0 گوییم حلقه موضعی r یک حلقه c - موضعی است هرگاه و{0 و z(r)^2={cو z(r)^3=0, نیز xz( r)=0 نتیجه دهد که x عضو {c,0 } است. در این پایان نامه ساخ...
Identification of scalar errors-in-variables models with dynamics
The paper considers the task of identifying a causal linear dynamic system excited by stationary gaussian zero mean noise of unknown spectrum, and given measurements of the system input and output contaminated by independent additive stationary noise 91g0813 of unknown spectra. While the solution is normally not unique, finite-dimensional parameterizations of the solution set are given (in some...
متن کاملHybrid tractable CSPs which generalize tree structure
The constraint satisfaction problem (CSP) is a central generic problem in artificial intelligence. Considerable progress has been made in identifying properties which ensure tractability in such problems, such as the property of being tree-structured. In this paper we introduce the broken-triangle property, which allows us to define a hybrid tractable class for this problem which significantly ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IMA Journal of Applied Mathematics
سال: 2008
ISSN: 0272-4960,1464-3634
DOI: 10.1093/imamat/hxn011